A Congestion Control Algorithm for Data Center Area Communications
نویسندگان
چکیده
Ethernet is extending its applications to data-center area, i.e. very short distance, communications such as CPU-CPU and CPU-I/O interconnections, where short end-to-end (MAC-to-MAC) data transfer delay is the key performance factor. In this paper, we propose an extended Ethernet MAC mechanism providing end-to-end reliable and congestion controlled packet transfer that minimizes data transfer delay. The proposed MAC mechanism employs a packet retransmission mechanism and a delay-based congestion control algorithm with inline initial bandwidth probing. Since inline bandwidth probing with small number of data packets tends to overestimate the initial bandwidth, we introduced two extended mechanisms; two-stage probing and RTT prediction. The RTT prediction mechanism detects congestion several RTTs earlier than using measured RTT and thus minimize queuing delay. The two-stage probing mechanism adaptively starts up data transfers without overflowing the link. The simulation results show that the proposed mechanism achieves roughly 10 times shorter transfer delay compared to TCP and 2-3 times shorter delay compared to existing delay-based congestion controls.
منابع مشابه
An Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...
متن کاملAn Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...
متن کاملFairness Improvement of Multiple-Bottleneck Flow in Data Center Networks
Quantized Congestion Notification (QCN), discussed in IEEE 802.1Qau, is one of the promising layer 2 congestion control methods for data center networks. Data center network fundamentally has symmetric structure and links are designed to have high link utilizations. So, data center flows probably pass through multiple bottleneck links. QCN reduces its transmission rate with each congestion noti...
متن کاملCongestion Control for TCP in Data-Center Networks
The several corresponding servers may send the data concurrently in a circle manner to a specific receiver. For example, data center applications such as Map-Reduce and Search applications are using many-to-one TCP traffic pattern i.e. parallel data delivery. While TCP connection is slow down the concurrent data deliver. The data delivery delay ensured the packet loss and time out in the TCP co...
متن کاملAn Empirical Workload Model for Driving Wide-Area TCP/IP Network Simulations
Abstract We present an artificial workload model of wide-area internetwork traffic. The model can be used to drive simulation experiments of communication protocols and flow and congestion control experiments. The model is based on analysis of wide-area TCP/IP traffic collected from one industrial and two academic networks. The artificial workload model uses both detailed knowledge and measured...
متن کامل